Root-clustering for multivariate polynomials and robust stability analysis
نویسنده
چکیده
منابع مشابه
Robustly Stable Multivariate Polynomials
We consider stability and robust stability of polynomials with respect to a given arbitrary disjoint decomposition C n = Γ⊎Λ. The polynomial is called stable if it has no zeros in the region of instability Λ and robustly stable if it is stable and remains so under small variations of its coefficients. Inspired by the article Robust stability of multivariate polynomials. Part 1: Small coefficien...
متن کاملRoot clustering method for a small-signal stability analysis of power systems
We present a new method of a small-signal stability analysis for power systems with parametric uncertainties in load characteristics. These uncertainties must always be considered in a power system stability assessment since a power demand changes constantly and a precise composition of the electrical loads is usually unknown. The proposed method is based on an iterative algorithm which determi...
متن کاملAssessing 3-D Uncertain System Stability by Using MATLAB Convex Hull Functions
This paper is dealing with the robust stability of an uncertain three dimensional (3-D) system using existence MATLAB convex hull functions. Hence, the uncertain model of plant will be simulated by INTLAB Toolbox; furthermore, the root loci of the characteristic polynomials of the convex hull are obtained to judge whether the uncertain system is stable or not. A design third order example for u...
متن کاملA Tabular Algorithm for Testing the Robust Hurwitz Stability of Convex Combinations of Complex Polynomials
In this paper we present a tabular algorithm for testing the Hurwitz property of a segment of complex polynomials. The algorithm consists in constructing a parametric Routhlike array with polynomial entries and generating Sturm sequences for checking the absence of zeros of two real polynomials in the interval (0,1). The presented algorithm is easy to implement. Moreover, it accomplishes the te...
متن کاملThe Bernstein Algorithm
We solve the problem of finding an enclosure for the range of a multivariate polynomial over a rectangular region by expanding the given polynomial into Bernstein polynomials. Then the coefficients of the expansion provide lower and upper bounds for the range and these bounds converge monotonically if the degree of the Bernstein polynomials is elevated. To obtain a faster improvement of the bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004